Forward Constraint-Based Algorithms for Anytime Planning
نویسندگان
چکیده
This paper presents a generic anytime forward-search constraint-based algorithm for solving planning problems expressed in the CNT framework (Constraint Network on Timelines). It is generic because it allows many kinds of search to be covered, from complete tree search to greedy search. It is anytime because some parameter settings, together with domain-specific knowledge, allow high quality plans to be produced very quickly and to be further improved. It is forward because it systematically considers the decisions to be made in a chronological order. It is finally constraint-based because it is built on top of the CNT framework which is an extension of the CSP framework able to model discrete event dynamic systems and because it is implemented on top of the Choco constraint programming tool from which it inherits all the constraint handling machinery. Experimental comparisons are made in terms of quality profile with other domain-dependent and domain-independent planners.
منابع مشابه
Enhancing the Anytime Behaviour of Mixed CSP-Based Planning
An algorithm with the anytime property has an approximate solution always available; and the longer the algorithm runs, the better the solution becomes. Anytime planning is important in domains such as aerospace, where time for reasoning is limited and a viable (if suboptimal) course of action must be always available. In this paper we study anytime solving of a planning problem under uncertain...
متن کاملHandling Temporal Constraints in a Dynamic Environment
Managing symbolic and metric temporal information is fundamental for many real world applications such as scheduling, planning, data base design, computational linguistics and computational models for molecular biology. This motivates us to develop a temporal constraint solving system based on CSPs for handling the two types of temporal information. A main challenge when designing such systems ...
متن کاملDistributed Heuristic Forward Search for Multi-agent Planning
This paper deals with the problem of classical planning for multiple cooperative agents who have private information about their local state and capabilities they do not want to reveal. Two main approaches have recently been proposed to solve this type of problem – one is based on reduction to distributed constraint satisfaction, and the other on partial-order planning techniques. In classical ...
متن کاملFragment-Based Planning Using Column Generation
We introduce a novel algorithm for temporal planning in Golog using shared resources, and describe the Bulk Freight Rail Scheduling Problem, a motivating example of such a temporal domain. We use the framework of column generation to tackle complex resource constrained temporal planning problems that are beyond the scope of current planning technology by combining: the global view of a linear p...
متن کاملA Guide to Heuristic-based Path Planning
We describe a family of recently developed heuristicbased algorithms used for path planning in the real world. We discuss the fundamental similarities between static algorithms (e.g. A*), replanning algorithms (e.g. D*), anytime algorithms (e.g. ARA*), and anytime replanning algorithms (e.g. AD*). We introduce the motivation behind each class of algorithms, discuss their use on real robotic sys...
متن کامل